Polynomial Interpretations with Negative Coefficients
نویسندگان
چکیده
Polynomial interpretations are a useful technique for proving termination of term rewrite systems. We show how polynomial interpretations with negative coefficients, like x− 1 for a unary function symbol or x− y for a binary function symbol, can be used to extend the class of rewrite systems that can be automatically proved terminating.
منابع مشابه
Polynomial Interpretations over the Reals do not Subsume Polynomial Interpretations over the Integers
Polynomial interpretations are a useful technique for proving termination of term rewrite systems. They come in various flavors: polynomial interpretations with real, rational and integer coefficients. In 2006, Lucas proved that there are rewrite systems that can be shown polynomially terminating by polynomial interpretations with real (algebraic) coefficients, but cannot be shown polynomially ...
متن کاملPolynomial Interpretations over the Natural, Rational and Real Numbers Revisited
Polynomial interpretations are a useful technique for proving termination of term rewrite systems. They come in various flavors: polynomial interpretations with real, rational and integer coefficients. As to their relationship with respect to termination proving power, Lucas managed to prove in 2006 that there are rewrite systems that can be shown polynomially terminating by polynomial interpre...
متن کاملMaximal Termination
We present a new approach for termination proofs that uses polynomial interpretations (with possibly negative coefficients) together with the “maximum” function. To obtain a powerful automatic method, we solve two main challenges: (1) We show how to adapt the latest developments in the dependency pair framework to our setting. (2) We show how to automate the search for such interpretations by i...
متن کاملMonotonicity Criteria for Polynomial Interpretations over the Naturals
Polynomial interpretations are a useful technique for proving termination of term rewrite systems. In an automated setting, termination tools are concerned with parametric polynomials whose coefficients (i.e., the parameters) are initially unknown and have to be instantiated suitably such that the resulting concrete polynomials satisfy certain conditions. We focus on monotonicity and well-defin...
متن کاملCombinatorial probability interpretation of certain modified orthogonal polynomials
A probabilistic interpretation of a modified Gegenbauer polynomial is furnished by its expression in terms of a combinatorial probability defined on a compound urn model. Also, a combinatorial interpretation of its coefficients is provided. In particular, probabilistic interpretations of a modified Chebyshev polynomial of the second kind and a modified Legendre polynomial together with combinat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004